-
1 graph with color edges
Макаров: граф с цветными ребрамиУниверсальный англо-русский словарь > graph with color edges
-
2 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт моносимвольная графема, граф•- graph of strictly partial order
- acyclic graph
- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- linked pie-column graph
- line-symmetric graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed graph
- mixed column/line graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- R-graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclically closed graph
- strongly cyclic edge connected graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graph -
3 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт. моносимвольная графема, граф•- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- graph of contiguous channels
- graph of strictly partial order
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- line-symmetric graph
- linked pie-column graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed column/line graph
- mixed graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- R-graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclic edge connected graph
- strongly cyclically closed graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graphThe New English-Russian Dictionary of Radio-electronics > graph
См. также в других словарях:
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Graph property — In graph theory a graph property is any inherently graph theoretical property of graphs (formal definitions follow), distinguished from properties of graphs described in terms of various graph representations: graph drawings, data structures for… … Wikipedia
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
Graph homomorphism — Not to be confused with graph homeomorphism. In the mathematical field of graph theory a graph homomorphism is a mapping between two graphs that respects their structure. More concretely it maps adjacent vertices to adjacent vertices. Contents 1… … Wikipedia
Graph operations — Operations on graphs produce new graphs from old ones. They may be separated into the following major categories. Contents 1 Unary operations 1.1 Elementary operations 1.2 Advanced operations 2 … Wikipedia
Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… … Wikipedia
Five color theorem — The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the counties of a state, the regions may be colored using no more than five colors in such a way that no two adjacent… … Wikipedia
Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… … Wikipedia